Round Robin on Quantitative Phase Analysis

Gearbox Reliability Collaborative Analysis Round Robin: Preprint

Security proof for Round Robin Differential Phase Shift QKD

We give a security proof of the ‘Round Robin Differential Phase Shift’ Quantum Key Distribution scheme, and we give a tight bound on the required amount of privacy amplification. Our proof consists of the following steps. We construct an EPR variant of the scheme. We identify Eve’s optimal way of coupling an ancilla to an EPR qudit pair under the constraint that the bit error rate between Alice...

Round-Robin Arbiter Design

Round-robin has been used as a fair (non starvation) scheduling policy in many computer applications. This paper presents a novel hardware design of a round-robin arbiter without any misses – It always grants an available resource to one of legitimate requests, which may be very unevenly generated from various sources. The design is modeled in HDL, logically verified and then synthesized target...

Round robin ensembles

In this paper we investigate the performance of pairwise (or round robin) classification, originally a technique for turning multi-class problems into two-class problems, as a general ensemble technique. In particular, we show that the use of round robin ensembles will also increase the classification performance of decision tree learners, even though they can directly handle multiclass problem...

Round Robin Classification

In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifier for each pair of classes. We present an empirical evaluation of the method, implemented as a wrapper around the Ripper rule learning algorithm, on 20 multi-class datasets from the UCI database repository. Our results...